Fast k-NN classification rule using metric on space-filling curves
نویسندگان
چکیده
A fast nearest neighbor algorithm for pattern classiication is proposed and tested on real data. The patterns (points in d-dimensional Euclidean space) are sorted along a space-lling curve. This way the multidi-mensional problem is compressed to the simplest case of the nearest neighbor search in one dimension.
منابع مشابه
Some improvements on NN based classifiers in metric spaces
The nearest neighbour (NN) and k-nearest neighbour (k-NN) classification rules have been widely used in Pattern Recognition due to its simplicity and good behaviour. Exhaustive nearest neighbour search may become unpractical when facing large training sets, high dimensional data or expensive dissimilarity measures (distances). During the last years a lot of fast NN search algorithms have been d...
متن کاملHilbert Space Filling Curve (hsfc) Nearest Neighbor Classifier
The Nearest Neighbor algorithm is one of the simplest and oldest classification techniques. A given collection of historic data (Training Data) of known classification is stored in memory. Then based on the stored knowledge the classification of an unknown data (Test Data) is predicted by finding the classification of the nearest neighbor. For example, if an instance from the test set is presen...
متن کاملAutomatic fibrosis quantification by using a k-NN classificator
This work presents an automatic algorithm to measure fibrosis in muscle sections of mdx mice, a mutant species used as a model of the Duchenne dystrophy. The algorithm described herein automatically segments three different tissues: Muscle cell tissue (MT), Pure collagen fiber deposit (CD) and cellular infiltrates surrounded by loose collagen deposit (CI), by using a statistical classifier base...
متن کاملA fast algorithm for finding k-nearest neighbors with non-metric dissimilarity
Fast nearest neighbor (NN ) finding has been extensively studied. While some fast NN algorithms using metrics rely on the essential properties of metric spaces, the others using non-metric measures fail for large-size templates. However, in some applications with very large size templates, the best performance is achieved by NN methods based on the dissimilarity measures resulting in a special ...
متن کاملMulti-class Leveraged κ-NN for Image Classification
The k-nearest neighbors (k-NN) classification rule is still an essential tool for computer vision applications, such as scene recognition. However, k-NN still features some major drawbacks, which mainly reside in the uniform voting among the nearest prototypes in the feature space. In this paper, we propose a new method that is able to learn the “relevance” of prototypes, thus classifying test ...
متن کامل